Six Degrees of Separation in Boolean Function Networks with Neutrality

نویسنده

  • Tina Yu
چکیده

Abstract. We analyze two Boolean function networks with different degrees of neutrality. The results show that the one with explicit neutrality is a small-world network where each pair of possible solutions has a short distance and most of the possible solutions are highly clustered. These network structural properties owe their existence to the “short cuts” introduced by redundant genes in the genotypes. We explain some important small-world network structures, such as clusters, hubs and power law link distribution. These properties have potential to be useful in designing efficient evolutionary algorithms to navigate search in the network.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Neutrality and the Evolvability of Boolean Function Landscape

This work is a study of neutrality in the context of Evolutionary Computation systems. In particular, we introduce the use of explicit neutrality with an integer string coding scheme to allow neutrality to be measured during evolution. We tested this method on a Boolean benchmark problem. The experimental results indicate that there is a positive relationship between neutrality and evolvability...

متن کامل

Separation Number and Generalized Clustering Coefficient in Small World Networks based on String Formalism

We reformulated the string formalism given by Aoyama, using an adjacent matrix of a network and introduced a series of generalized clustering coefficients based on it. Furthermore we numerically evaluated Milgram condition proposed by their article in order to explore q-th degrees of separation in scale free networks. In this article, we apply the reformulation to small world networks and numer...

متن کامل

Analysis of biological networks: Real networks and random network

Social networks are amongst the first to be studied. Six degrees of separation is the theory that anyone on earth can be connected to any other person on the planet through a chain of acquaintances that has no more than five intermediaries. The theory was first proposed in 1929 by the Hungarian writer Frigyes Karinthy in a short story called Chains. In 1967, American sociologist Stanley Milgram...

متن کامل

Effect of Closed Paths in Complex networks on Six Degrees of Separation and Disorder

Milgram Condition proposed by Aoyama et al. [11] plays an important role on the analysis of ”six degrees of separation”. We have shown[16], [17] that the relations between Milgram condition and the generalized clustering coefficient, which was introduced as an index for measuring the number of closed paths by us[6]-[10], are absolutely different in scale free networks [12] and small world netwo...

متن کامل

ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES

Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011